k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint
نویسندگان
چکیده
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملEnhanced Clustering Based on K-means Clustering Algorithm and Proposed Genetic Algorithm with K-means Clustering
-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...
متن کاملClustering with Transitive Distance and K-Means Duality
Recent spectral clustering methods are a propular and powerful technique for data clustering. These methods need to solve the eigenproblem whose computational complexity is O(n), where n is the number of data samples. In this paper, a non-eigenproblem based clustering method is proposed to deal with the clustering problem. Its performance is comparable to the spectral clustering algorithms but ...
متن کاملEmpirical Comparison of a Monothetic Divisive Clustering Method with the Ward and the k-means Clustering Methods
DIVCLUS-T is a descendant hierarchical clustering methods based on the same monothetic approach than segmentation but from an unsupervised point of view. The dendrogram of the hierarchy is easy to interpret and can be read as decision tree. We present DIVCLUS-T on a small numerical and a small categorical example. DIVCLUS-T is then compared with two polythetic clustering methods: the Ward ascen...
متن کاملEvaluation of Structured Parallelization of k-Means-Based Clustering Methods
At the present time, data size and complexity of clustering tasks (e.g. machine learning) demand parallel computing on multiple cores. However, designing parallel applications using threads and blocking is prone to non-trivial errors. This thesis uses an structured parallelization approach called algorithmic skeletons to build a model to express variants of one of the most used algorithms in da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Classification
سال: 2020
ISSN: 0176-4268,1432-1343
DOI: 10.1007/s00357-020-09370-5